Performance Efficient Heterogeneous Multi Core Scheduling Strategy Based on Genetic Algorithm

نویسندگان

  • A. S. Radhamani
  • E. Baburaj
چکیده

Multi-core processors offer a significant performance increase over single core processors. Therefore, they have the potential to enable computation-intensive real-time applications with stringent timing constraints that cannot be met on traditional single-core processors. However, with the number of cores on a single chip continuing to increase, it has been a great challenge to effectively manage the energy efficiency of multicore based systems. Power and temperature management are also two concerns that can increase exponentially with the addition of multiple cores. Design innovations in multicore processor architectures bring new optimization opportunities and challenges in the computing era. System performance will be further enhanced by addressing these challenges. In particular, the process (task) scheduler is one of the critical challenge is garnering great interest. High performance in a heterogeneous multicore system is essential which is achieved by effective scheduling, which remains a challenging problem. Further multi core technology opens research opportunities for energy reduction through efficient scheduling. There may be different hardware and software solutions for the above issue; hardware solutions are based on adjusting dynamic voltage per core, alternatively software approach includes, scheduling task among cores, in heterogeneous environment. Task scheduling in multicore architecture is an extremely difficult problem, because it requires a large combinatorial search space and also precedence constraints between the processes; for the effective utilization of multi core processor system, efficient assignment and scheduling of jobs is more important. Many of the existing algorithms are not focused on task scheduling and core utilization in heterogeneous multi core systems. This paper formulates task scheduling as an optimization problem and the results are compared with the earlier faster scheduler in use. Findings show that, in addition to its optimum solution for large scale problem, the Genetic Algorithm (GA) proposed here fits the heterogeneous multi core parallel scheduling problem of minimizing the completion time as well as in effective core utilization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation

In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...

متن کامل

A new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems

Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...

متن کامل

Efficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems

Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013